Hyperchaos-Based Cryptosystem for Multimedia Data Security
نویسندگان
چکیده
منابع مشابه
Modified GPT Cryptosystem for Information Network Security
To provide information security in network we use the public key GPT (Gabidulin–Paramonov–Tretiyakov) cryptosystem based on rank codes. This cryptosystem was the subject of several attacks. Some of them were structural attacks, others were decoding attacks. In our opinion the most dangerous are structural attacks because decoding attacks can be prevented by proper choice of parameters. To preve...
متن کاملTransactions on Data Hiding and Multimedia Security
In this volume we present the tenth issue of the LNCS Transactions on Data Hiding and Multimedia Security, which includes six papers. The first paper presents a new method to reduce mutual information via embedding watermark in the key controlled wavelet domain. The second paper presents a perceptual image hashing algorithm based on wave atom transform, which can distinguish maliciously attacke...
متن کاملEnergy/security scalable mobile cryptosystem
Time-sensitive mobile commerce is vulnerable to message authentication delays. Significant power consumption incurred by cryptography is another limiting factor of most mobile devices. In this paper, we present a scalable mobile cryptosystem, which installs a group key and an elliptic curve private/public key pair in each device to enable both symmetric key and public key cryptography. We propo...
متن کاملA Hierarchical Security Model for Multimedia Big Data
In this paper, the author proposes a hierarchical security model (HSM) to enhance security assurance for multimedia big data. It provides role hierarchy management and security roles/rules administration by seamlessly integrating the role-based access control (RBAC) with the object-oriented concept, spatio-temporal constraints, and multimedia standard MPEG-7. As a result, it can deal with chall...
متن کاملSecurity of an Identity-Based Cryptosystem and the Related Reductions
Recently an efficient solution to the discrete logarithm problem on elliptic curves over F, with p points ( p : prime), so-called anornalous curues, was independently discovered by Semaev [14], Smart [17], and Satoh and Araki [12]. Since the solution is very efficient, i.e., 0 ( l p l 3 ) , the Semaev-Smart-Satoh-Araki (SSSA) algorithm implies the possibility of realizing a trapdoor for the dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algerian Journal of Signals and Systems
سال: 2021
ISSN: 2676-1548,2543-3792
DOI: 10.51485/ajss.v1i1.18